$LINSPACE$ конструктивный аналог функции $(1+x)^h$

FP//LINSPACE computability of Riemann zeta function in Ko-Friedman model

In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function ζ(s) for all real s, s > 1, in polynomial time and linear space on Turing machines in Ko–Friedman model. The algorithms is based on a series expansion of real Riemann zeta function ζ(s) (the series globally convergents) and uses algorithms for the evaluation of real function (1 + x) h and hypergeo-m...

Метаданные, их свойства, функции, классификация и средства представления (Metadata, their Properties, Functions and Classifications)

Методика построения функции принадлежности для классификации изображений на основе гистограмм яркости (The Method of Constructing the Membership Function to Classify Images Based on Histograms)

The Implicit Computational Complexity of Imperative Programming Languages

During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit computational complexity, i.e. the theory of predicative recursion, tiered definition schemes, etcetera. We extend and modify this theory to work in a context of imperative programming languages, and characterise complexity classes like P, linspace, pspace and the classes in the Grzegorczyk hiearch...

On a relation between uniform coding and problems of the form DTIMEF ( F ) = ? DSPACEF ( F ) Salvatore

If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE = EXPTIME 6= EXPSPACE = 2-EXPTIME, and, for all p, we have p−EXPSPACE = p+1-EXPTIME; if it can be performed in LINSPACEF, we also have LINSPACE = DTIME(2); the proof fails, when relativized to oracle-TM’s. A by-product of this research is that PTIMEF is not closed under number-...